Enhanced geographically typed semantic schema matching

نویسندگان

  • Jeffrey Partyka
  • Pallabi Parveen
  • Latifur Khan
  • Bhavani M. Thuraisingham
  • Shashi Shekhar
چکیده

Resolving semantic heterogeneity across distinct data sources remains a highly relevant problem in the GIS domain requiring innovative solutions. Our approach, called GSim, semantically aligns tables from respective GIS databases by first choosing attributes for comparison. We then examine their instances and calculate a similarity value between them called entropy-based distribution (EBD) by combining two separate methods. Our primary method discerns the geographic types from instances of compared attributes. If successful, EBD is calculated using only this method. GSim further facilitates geographic type matching by using latlong values to further disambiguate between multiple types of a given instance and applying attribute weighting to quantify the uniqueness of mapped attributes. If geographic type matching is not possible, we then apply a generic schema matching method, independent of the knowledge domain, which employs normalized Google distance. We show the effectiveness of our approach over the traditional approaches across multijurisdictional datasets by generating impressive results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem

The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema matching . Semantic schema matching has been extensively researched, and many matching systems have been developed. However, formal specifications of problems being solved by th...

متن کامل

A Classification of Schema-Based Matching Approaches

Schema/ontology matching is a critical problem in many application domains, such as, semantic web, schema/ontology integration, data warehouses, e-commerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema-based matching techniques that builds on the previous work on classifying schema matching approac...

متن کامل

Schema-based Semantic Matching: Algorithms, a System and a Testing Methodology PhD Thesis Proposal

Schema/ontology/classification matching is a critical problem in many application domains, such as, schema/ontology/classification integration, data warehouses, e-commerce, web services coordination, Semantic Web, semantic query processing, etc. We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. Semantic matching is ...

متن کامل

A Survey of Schema-Based Matching Approaches

Schema and ontology matching is a critical problem in many application domains, such as semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many different matching solutions have been proposed so far. In this paper we present a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching. Some inn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Web Sem.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2011